Pii: S0168-9274(01)00116-7
نویسندگان
چکیده
We consider the parallel computation of the stationary probability distribution vector of ergodic Markov chains with large state spaces by preconditioned Krylov subspace methods. The parallel preconditioner is obtained as an explicit approximation, in factorized form, of a particular generalized inverse of the generator matrix of the Markov process. Graph partitioning is used to parallelize the whole algorithm, resulting in a two-level method. Conditions that guarantee the existence of the preconditioner are given, and the results of a parallel implementation are presented. Our results indicate that this method is well suited for problems in which the generator matrix can be explicitly formed and stored. 2001 IMACS. Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0168-9274(01)00181-7
An energy-preserving explicit extension operator is proposed to extend finite element functions defined on the boundary of a star-shaped polygonal domain into its interior. The pre-assigned finite element triangulation in the interior of the domain needs not be multilevel-structured. The extension operator has wide applications in the construction of non-overlapping domain decomposition methods...
متن کاملPii: S0168-9274(01)00134-9
A postprocessing technique to improve the accuracy of Galerkin methods, when applied to dissipative partial differential equations, is examined in the particular case of very smooth solutions. Pseudospectral methods are shown to perform poorly. This performance is studied and a refined postprocessing technique is proposed. 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(02)00116-2
In recent years, a great deal of attention has been devoted to Krylov subspace techniques for reduced-order modeling of large-scale dynamical systems. The surge of interest was triggered by the pressing need for efficient numerical techniques for simulations of extremely large-scale dynamical systems arising from circuit simulation, structural dynamics, and microelectromechanical systems. In th...
متن کاملPii: S0168-9274(01)00131-3
We present in this paper optimal and accelerated row projection algorithms arising from the use of quadratic programming, that allow us to define the iterate xk+1 as the projection of x onto a hyperplane which minimizes its distance to the solution x∗. These algorithms also use a novel partition strategy into blocks based on sequential estimations of their condition numbers. 2001 IMACS. Publi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002